type github.com/klauspost/compress/zstd.prevEntry

44 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L71: 	table         [bestShortTableSize]prevEntry
		enc_best.go#L72: 	longTable     [bestLongTableSize]prevEntry
		enc_best.go#L73: 	dictTable     []prevEntry
		enc_best.go#L74: 	dictLongTable []prevEntry
		enc_best.go#L89: 			e.table = [bestShortTableSize]prevEntry{}
		enc_best.go#L90: 			e.longTable = [bestLongTableSize]prevEntry{}
		enc_best.go#L110: 			e.table[i] = prevEntry{
		enc_best.go#L129: 			e.longTable[i] = prevEntry{
		enc_best.go#L291: 		e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: candidateL.offset}
		enc_best.go#L292: 		e.table[nextHashS] = prevEntry{offset: s + e.cur, prev: candidateS.offset}
		enc_best.go#L386: 				e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_best.go#L387: 				e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L446: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_best.go#L447: 			e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L486: 			e.dictTable = make([]prevEntry, len(e.table))
		enc_best.go#L499: 			e.dictTable[nextHash] = prevEntry{
		enc_best.go#L503: 			e.dictTable[nextHash1] = prevEntry{
		enc_best.go#L507: 			e.dictTable[nextHash2] = prevEntry{
		enc_best.go#L511: 			e.dictTable[nextHash3] = prevEntry{
		enc_best.go#L521: 			e.dictLongTable = make([]prevEntry, len(e.longTable))
		enc_best.go#L528: 			e.dictLongTable[h] = prevEntry{
		enc_best.go#L538: 				e.dictLongTable[h] = prevEntry{
		enc_better.go#L29: type prevEntry struct {
		enc_better.go#L43: 	longTable [betterLongTableSize]prevEntry
		enc_better.go#L49: 	dictLongTable        []prevEntry
		enc_better.go#L68: 			e.longTable = [betterLongTableSize]prevEntry{}
		enc_better.go#L97: 			e.longTable[i] = prevEntry{
		enc_better.go#L174: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L226: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L283: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L364: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L508: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L535: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L594: 				e.longTable[i] = prevEntry{}
		enc_better.go#L625: 			e.longTable[i] = prevEntry{
		enc_better.go#L692: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L745: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L805: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L889: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L1024: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L1054: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L1145: 			e.dictLongTable = make([]prevEntry, len(e.longTable))
		enc_better.go#L1152: 			e.dictLongTable[h] = prevEntry{
		enc_better.go#L1162: 				e.dictLongTable[h] = prevEntry{